背景：最近，在疫苗接种率相对较高的地区，已经报告了大量的每日CoVID-19例阳性病例。因此，助推器疫苗接种已成为必要。此外，尚未深入讨论由不同变体和相关因素引起的感染。具有较大的变异性和不同的共同因素，很难使用常规数学模型来预测Covid-19的发生率。方法：基于长期短期记忆的机器学习被应用于预测新每日阳性病例（DPC），严重病例，住院病例和死亡的时间序列。从以色列等疫苗接种率高的地区获得的数据与日本其他地区的当前数据混合在一起，以考虑疫苗接种的潜在影响。还考虑了症状感染提供的保护，从疫苗接种的人口效力以及病毒变异的减弱保护，比率和感染性的降低。为了代表公共行为的变化，分析还包括通过社交媒体进行的公共流动性和通过社交媒体的互动。研究结果：比较特拉维夫，以色列观察到的新DPC，表征疫苗接种效果的参数和免受感染的减弱保护； 5个月后第二剂量的疫苗接种效率和三角变体感染后两周后的第三剂量分别为0.24和0.95。使用有关疫苗接种效果的提取参数，复制了日本三个县的新病例。

过去十年来，人们对人工智能（AI）的兴趣激增几乎完全由人工神经网络（ANN）的进步驱动。尽管ANN为许多以前棘手的问题设定了最先进的绩效，但它们需要大量的数据和计算资源进行培训，并且由于他们采用了监督的学习，他们通常需要知道每个培训示例的正确标记的响应，并限制它们对现实世界域的可扩展性。尖峰神经网络（SNN）是使用更多类似脑部神经元的ANN的替代方法，可以使用无监督的学习来发现输入数据中的可识别功能，而又不知道正确的响应。但是，SNN在动态稳定性方面挣扎，无法匹配ANN的准确性。在这里，我们展示了SNN如何克服文献中发现的许多缺点，包括为消失的尖峰问题提供原则性解决方案，以优于所有现有的浅SNN，并等于ANN的性能。它在使用无标记的数据和仅1/50的训练时期使用无监督的学习时完成了这一点（标记数据仅用于最终的简单线性读数层）。该结果使SNN成为可行的新方法，用于使用未标记的数据集快速，准确，有效，可解释的机器学习。

本文介绍了一个基于计算机视觉的框架，该框架可以通过使用已安装的监视/CCTV摄像头来检测道路交通崩溃（RCT），并实时将其报告给紧急情况，并确切的事故发生的确切位置和时间。该框架由五个模块构建。我们从使用Yolo架构来检测车辆开始。第二个模块是使用MOSSE跟踪器对车辆的跟踪，然后第三个模块是一种基于碰撞估计的新方法来检测事故。然后是每辆车的第四个模块，我们检测到是否发生了基于暴力流动描述符（VIF）的车祸，然后是SVM分类器进行崩溃预测。最后，在最后阶段，如果发生车祸，系统将使用GPS模块向我们发送通知GSM模块的帮助。主要目的是通过更少的错误警报实现更高的准确性，并基于管道技术实施一个简单的系统。

Automl系统通过对有效的数据转换和学习者进行搜索以及为每个学习者进行超参数优化，从而自动构建机器学习模型。许多汽车系统使用元学习来指导搜索最佳管道。在这项工作中，我们提出了一个名为KGPIP的新颖的元学习系统，（1）通过通过程序分析挖掘数千个脚本来构建数据集和相应管道数据库，（2）使用数据集嵌入式来在数据库中找到基于数据库的类似数据集（3）在其内容上而不是基于元数据的功能上，模型Automl Pipeline创建作为图形生成问题，以简洁地表征单个数据集看到的各种管道。 KGPIP的元学习是汽车系统的子组件。我们通过将KGPIP与两个自动系统集成在一起来证明这一点。我们使用126个数据集的全面评估，包括最先进的系统使用的数据集，这表明KGPIP明显优于这些系统。

Variational inference uses optimization, rather than integration, to approximate the marginal likelihood, and thereby the posterior, in a Bayesian model. Thanks to advances in computational scalability made in the last decade, variational inference is now the preferred choice for many high-dimensional models and large datasets. This tutorial introduces variational inference from the parametric perspective that dominates these recent developments, in contrast to the mean-field perspective commonly found in other introductory texts.

Knowledge graphs (KG) have served as the key component of various natural language processing applications. Commonsense knowledge graphs (CKG) are a special type of KG, where entities and relations are composed of free-form text. However, previous works in KG completion and CKG completion suffer from long-tail relations and newly-added relations which do not have many know triples for training. In light of this, few-shot KG completion (FKGC), which requires the strengths of graph representation learning and few-shot learning, has been proposed to challenge the problem of limited annotated data. In this paper, we comprehensively survey previous attempts on such tasks in the form of a series of methods and applications. Specifically, we first introduce FKGC challenges, commonly used KGs, and CKGs. Then we systematically categorize and summarize existing works in terms of the type of KGs and the methods. Finally, we present applications of FKGC models on prediction tasks in different areas and share our thoughts on future research directions of FKGC.

Few Shot Instance Segmentation (FSIS) requires models to detect and segment novel classes with limited several support examples. In this work, we explore a simple yet unified solution for FSIS as well as its incremental variants, and introduce a new framework named Reference Twice (RefT) to fully explore the relationship between support/query features based on a Transformer-like framework. Our key insights are two folds: Firstly, with the aid of support masks, we can generate dynamic class centers more appropriately to re-weight query features. Secondly, we find that support object queries have already encoded key factors after base training. In this way, the query features can be enhanced twice from two aspects, i.e., feature-level and instance-level. In particular, we firstly design a mask-based dynamic weighting module to enhance support features and then propose to link object queries for better calibration via cross-attention. After the above steps, the novel classes can be improved significantly over our strong baseline. Additionally, our new framework can be easily extended to incremental FSIS with minor modification. When benchmarking results on the COCO dataset for FSIS, gFSIS, and iFSIS settings, our method achieves a competitive performance compared to existing approaches across different shots, e.g., we boost nAP by noticeable +8.2/+9.4 over the current state-of-the-art FSIS method for 10/30-shot. We further demonstrate the superiority of our approach on Few Shot Object Detection. Code and model will be available.

Unsupervised domain adaptation (UDA) for semantic segmentation is a promising task freeing people from heavy annotation work. However, domain discrepancies in low-level image statistics and high-level contexts compromise the segmentation performance over the target domain. A key idea to tackle this problem is to perform both image-level and feature-level adaptation jointly. Unfortunately, there is a lack of such unified approaches for UDA tasks in the existing literature. This paper proposes a novel UDA pipeline for semantic segmentation that unifies image-level and feature-level adaptation. Concretely, for image-level domain shifts, we propose a global photometric alignment module and a global texture alignment module that align images in the source and target domains in terms of image-level properties. For feature-level domain shifts, we perform global manifold alignment by projecting pixel features from both domains onto the feature manifold of the source domain; and we further regularize category centers in the source domain through a category-oriented triplet loss and perform target domain consistency regularization over augmented target domain images. Experimental results demonstrate that our pipeline significantly outperforms previous methods. In the commonly tested GTA5$\rightarrow$Cityscapes task, our proposed method using Deeplab V3+ as the backbone surpasses previous SOTA by 8%, achieving 58.2% in mIoU.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.

The performance of inertial navigation systems is largely dependent on the stable flow of external measurements and information to guarantee continuous filter updates and bind the inertial solution drift. Platforms in different operational environments may be prevented at some point from receiving external measurements, thus exposing their navigation solution to drift. Over the years, a wide variety of works have been proposed to overcome this shortcoming, by exploiting knowledge of the system current conditions and turning it into an applicable source of information to update the navigation filter. This paper aims to provide an extensive survey of information aided navigation, broadly classified into direct, indirect, and model aiding. Each approach is described by the notable works that implemented its concept, use cases, relevant state updates, and their corresponding measurement models. By matching the appropriate constraint to a given scenario, one will be able to improve the navigation solution accuracy, compensate for the lost information, and uncover certain internal states, that would otherwise remain unobservable.